Randomized Matrix Decompositions Using R

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Matrix Decompositions using R

The singular value decomposition (SVD) is among the most ubiquitous matrix factorizations. Specifically, it is a cornerstone algorithm for data analysis, dimensionality reduction and data compression. However, despite modern computer power, massive datasets pose a computational challenge for traditional SVD algorithms. We present the R package rsvd, which enables the fast computation of the SVD...

متن کامل

Randomized algorithms and matrix decompositions

These notes discuss novel randomized algorithms for some tasks in numerical linear algebra, such as matrix multiplication and certain matrix decompositions (SVD, interpolative decomposition). One of the main motivations is the need for fast algorithms for the analysis of massive data. The emphasis will be more on algorithms and algorithmic tools rather than complexity or linear algebra. Randomi...

متن کامل

Matrix Decompositions Using sub-Gaussian Random Matrices

In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...

متن کامل

Using Matrix Decompositions in Formal Concept Analysis

One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all concepts from a huge incidence matrix. In some cases, we only need to compute some of them to test for common attributes. In our research we try to modify an incidence matrix using matrix decompositions, creating a ne...

متن کامل

Solving Linear Matrix Equations by Matrix Decompositions

In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided. Keywords—Matrix equation, Generalized inverse, Generalized singular-value decomposition.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Software

سال: 2019

ISSN: 1548-7660

DOI: 10.18637/jss.v089.i11